Asymptotic Miss Ratios over Independent References

نویسنده

  • Ronald Fagin
چکیده

I t is proven that under the assumption of independent references, the (apparently analytically and computationally intractable) expected LRU (least recently used) miss ratio with main memory size CAP can be approximated arbitrarily dosely by the (analytically and computationally tractable) expected working-set miss ratio with expected working-set size CAP, as the size of the database goes to infinity. Their common asymptotic value is given by a tractable formula involving integrals. An immediate corollary of the representation is the asymptotic independence of miss ratio from page size in the independent reference model and in some generalizations of this model. This result also has implications about the effect on miss ratio of variable or fixed partitioning of main memory, in case of multiprogramming. Furthermore, in certain database environments, we can answer the question as to how the size of main memory must vary in order to maintain the same miss ratio, when the size of the database increases. The methods of this paper are extended to give an asymptotic formula for the miss ratio under VMIN, the optimal variable-space page replacement algorithm under demand paging.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Misses in Non - Numeric ApplicationsThrough

To maximize the beneet and minimize the overhead of software-based latency tolerance techniques, we would like to apply them precisely to the set of dynamic references that suuer cache misses. Unfortunately , the information provided by the state-of-the-art cache miss prooling technique (summary prooling) is inadequate for references with intermediate miss ratios|it results in either failing to...

متن کامل

Predicting Data Cache Misses in Non - Numeric

To maximize the beneet and minimize the overhead of software-based latency tolerance techniques, we would like to apply them precisely to the set of dynamic references that suuer cache misses. Unfortunately , the information provided by the state-of-the-art cache miss prooling technique (summary prooling) is inadequate for references with intermediate miss ratios|it results in either failing to...

متن کامل

Efficient Calculation of Expected Miss Ratios in the Independent Reference Model

In the independent reference model of program behavior, King’s formulas for the expected FIFO (“first-in-first-out”) and expected LRU (“least-recently-used”) miss ratios each contain an exponential number of terms (very roughly nCAP, where n is the number of pages and CAP is the capacity of main memory). Hence, under the straightforward algorithms, these formulas are computationally intractable...

متن کامل

Properties of the Miss Ratio for a 2-Level Storage Model with LRU or FIFO Replacement Strategy and Independent References

We consider the behavior of a 2-level storage system operating with the LRU or the FIFO replacement strategy where accesses to the main storage are described by the independent reference model (IRM). Let the size of main storage be m. We prove that the miss ratio (i.e. the steady-state probability that the item currently required is not in main storage) exhibits the following properties: The mi...

متن کامل

Multi-Level Cache With Most Frequently Used Policy: A New Concept In Cache Design

The number of unique references in any program represents a small part of the total number of requested references. The unique references (small part of the total requested references) consist of two types: unique references that are used several times (most frequently used references) and unique references that are used once (least frequently used references). In this new cache design, the mos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1977